Complementary variational principles via generalised geometric programming
نویسندگان
چکیده
منابع مشابه
Generalised Complementary Arrays
We present a generalised setting for the construction of complementary array pairs and its proof, using a unitary matrix notation. When the unitaries comprise multivariate polynomials in complex space, we show that four definitions of conjugation imply four types of complementary pair types I, II, III, and IV. We provide a construction for complementary pairs of types I, II, and III over {1,−1}...
متن کاملDigital Circuit Optimization via Geometric Programming
This paper concerns a method for digital circuit optimization based on formulating the problem as a geometric program (GP) or generalized geometric program (GGP), which can be transformed to a convex optimization problem and then very efficiently solved. We start with a basic gate scaling problem, with delay modeled as a simple resistor-capacitor (RC) time constant, and then add various layers ...
متن کاملGeometric Programming with Stochastic Parameter
Geometric programming is efficient tool for solving a variety of nonlinear optimizationproblems. Geometric programming is generalized for solving engineering design. However,Now Geometric programming is powerful tool for optimization problems where decisionvariables have exponential form.The geometric programming method has been applied with known parameters. However,the observed values of the ...
متن کاملFixed points and variational principles with applications to capability theory of wellbeing via variational rationality
In this paper we first develop two new results of variational analysis. One is a fixed point theorem for parametric dynamic systems in quasimetric spaces, which can also be interpreted as an existence theorem of minimal points with respect to reflexive and transitive preferences for sets in products spaces. The other one is a variational principle for set-valued mappings acting from quasimetric...
متن کاملInformation-Geometric Optimization Algorithms: A Unifying Picture via Invariance Principles
We present a canonical way to turn any smooth parametric family of probability distributions on an arbitrary search space X into a continuous-time black-box optimization method onX , the informationgeometric optimization (IGO) method. Invariance as a major design principle keeps the number of arbitrary choices to a minimum. The resulting IGO flow is the flow of an ordinary differential equation...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1979
ISSN: 0022-247X
DOI: 10.1016/0022-247x(79)90160-4